Kinetic Sweep and Prune for Collision Detection
نویسندگان
چکیده
We propose an acceleration scheme for real-time many-body dynamic collision detection. We kinetize the sweep and prune method for many-body collision pruning, extending its application to dynamic collision detection via kinetic data structures. In doing so, we modify the method from sample-rate driven to event-driven, with no more events than the original method processed, also removing the per-frame overhead, allowing our method to scale well in terms of frame-rates. Unlike many schemes for many-body collision pruning, ours performs well in both sparse and dense environments, with few or many collisions.
منابع مشابه
Kinetic sweep and prune for multi-body continuous motion
We propose an acceleration scheme for real-time many-body dynamic collision detection. We kinetize the sweep and prune method for many-body collision pruning, extending its application to dynamic collision detection via kinetic data structures. In doing so, we modify the method from sample-rate-driven to event-driven, with no more events than the original method processed, also removing the per...
متن کاملSelf-collision Detection for Deforming Cables
Detecting self-collision for cables and similar objects is an important part of numerous models in computational biology (protein chains), robotics (electric cables), hair modeling, computer graphics, etc. In this paper the 1D sweep-and-prune algorithm for detecting self-collisions of a deforming cable comprising linear segments is investigated. The sweep-and-prune algorithm is compared with ot...
متن کاملCollision Detection: Broad Phase Adaptation from Multi-Core to Multi-GPU Architecture
We present in this paper several contributions on the collision detection optimization centered on hardware performance. We focus on the broad phase which is the first step of the collision detection process and propose three new ways of parallelization of the wellknown ”Sweep and Prune” algorithm. We first developed a multi-core model that takes into account the number of available cores. Mult...
متن کاملOutput Sensitive Collision Detection for Unisize Boxes
We show how a recent collision detection method, which is based on the familiar sweep and prune concept, can gain improved performance for the special class of simulations that only involves axis-aligned bounding boxes of the same size. The proposed modifications lead to a worst-case optimal output-sensitive algorithm in 2D. Furthermore, the experimental result shows that our method gives gener...
متن کاملA Broad Phase Collision Detection Algorithm Adapted to Multi-cores Architectures
Recent years have seen the impressive evolution of graphics hardware and processors architecture from single core to multi and many-core architectures. Confronted to this evolution, new trends in collision detection optimisation consist in proposing a solution that maps on the runtime architecture. We present, in this paper, two contributions in the field of collision detection in large-scale e...
متن کامل